Genetic Scheduling Algorithm for High-Level Synthesis

نویسندگان

  • P. Arató
  • Z. Á. Mann
  • A. Orbán
چکیده

High-level synthesis (HLS) aims at constructing the optimal hardware or software structure from a given high-level speci cation. This process involves a number of optimization steps, from which scheduling is the most crucial one, concerning both the running time of the process and the quality of the found solution. In this paper, we present a genetic algorithm for the scheduling problem in HLS. We describe in detail how this general heuristic could be applied to the particular engineering problem at hand. It is demonstrated with several measurements on industry benchmarks that the new algorithm performs better than previous methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

High Level Synthesis using Learning Automata Genetic Algorithm

High-level synthesis consists of many interdependent tasks such as scheduling, allocation and binding. All tasks in high-level synthesis are NP-complete and the design objectives are in conflict for nature, most of the already proposed approaches are not efficient in the exploration of the design space and not effective in the identification of different trade-offs. For these reasons, genetic a...

متن کامل

Staff Scheduling by a Genetic Algorithm

This paper describes a Genetic Algorithms approach to amanpower-scheduling problem arising at a Petrochemical Company. AlthoughGenetic Algorithms have been successfully used for similar problemsin the past, they always had to overcome the limitations of theclassical Genetic Algorithms paradigm in handling the conflict betweenobjectives and constraints. The approach taken here is to use an indir...

متن کامل

Using Genetic Algorithm for High-Level Synthesis

The main contribution of this paper is using bioinspired algorithms for high-level synthesis. There are number of heuristic algorithms for digital circuit synthesis, which can solve scheduling and binding problems, but these algorithms are time consuming for large designs and they cannot consider several constraints simultaneously. In this paper three genetic algorithms (GA) are developed to so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002